A divide and conquer approach to using inductive logic programming for learning user models

نویسنده

  • Heather Maclaren
چکیده

The use of Inductive Logic Programming (ILP) for the construction of a user model allows possibilities such as the use of intensional background knowledge and the ability to present a set of comprehensible rules to the user. A few simple concepts have previously been modelled using standard ILP methods but a concept of the complexity attempted within this dissertation brings problems which have not been attempted within the usermodelling context. This dissertation describes the problems encountered (and their solutions) when using ILP to build a user model that will be used to make detailed predictions of successive entries within an individual user’s online diary. Each predicted entry must contain several values — not just the type of task being performed, but also its location and duration — thus increasing the complexity of the clauses required. Other problems to be dealt with are the vague nature of the underlying concept to be modelled and the possibility of high levels of noise within the data collected from the user. The complexity of the clauses required and the large amount of background knowledge that could be used renders the size of the search space of possible hypotheses too large for an exploratory ILP engine such as Aleph to search adequately within the limited time available. The methods required to overcome these problems are presented within the algorithm Dilum (Dimensional ILP for User Modelling). Dilum pre-processes its given data set to split the concept to be learnt into separate subconcepts, and uses a divide-and-conquer approach when working with each subconcept to reduce the complexity of each learning problem to a more manageable level. The main contribution within this disseration is the use of these two techniques to significantly reduce the amount of computation time required for the kind of learning problem encountered within the scenario described earlier. It will be shown within this dissertation that the ideas encapsulated within Dilum enable construction of an accurate, usable, and understandable user-model, and that if the concept to be learnt is both vague and complex then even a greedy learning algorithm will require partitioning as a data pre-processing stage. It will also be shown that using conditional probability distributions as a measure of uncertainty whilst querying the user model not only helps to reduce the effects of noisy data on the accuracy of the predictions made by the model but also increases its precision.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Divide and Conquer Networks

We consider the learning of algorithmic tasks by mere observation of input-output pairs. Rather than studying this as a black-box discrete regression problem with no assumption whatsoever on the input-output mapping, we concentrate on tasks that are amenable to the principle of divide and conquer, and study what are its implications in terms of learning. This principle creates a powerful induct...

متن کامل

Using a Machine Learning Approach for Building Natural Language Interfaces for Databases: Application of Advanced Techniques in Inductive Logic Programming

Building a natural language interface for a database has been an interesting task since the 70‟s, which often requires creating a semantic parser. A study on using an advanced inductive logic programming (ILP) approach for semantic parser induction that combines different ILP learners to learn rules for ambiguity resolution is presented. Accuracy of the resulting induced semantic parser can be ...

متن کامل

Free Vibration Analysis of Repetitive Structures using Decomposition, and Divide-Conquer Methods

This paper consists of three sections. In the first section an efficient method is used for decomposition of the canonical matrices associated with repetitive structures. to this end, cylindrical coordinate system, as well as a special numbering scheme were employed. In the second section, divide and conquer method have been used for eigensolution of these structures, where the matrices are in ...

متن کامل

Learning Dynamic Programming with Split-Merge Networks

We consider the learning of algorithmic tasks by mere observation of input-output pairs. Rather than studying this as a black-box discrete regression problem with no assumption whatsoever on the input-output mapping, we concentrate on tasks that are amenable to the principle of divide and conquer, and study what are its implications in terms of learning. This principle creates a powerful induct...

متن کامل

Induction of Logic Programs by Example-Guided Unfolding

Resolution has been used as a specialisation operator in several approaches to top-down induction of logic programs. This operator allows the overly general hypothesis to be used as a declarative bias that restricts not only what predicate symbols can be used in produced hypotheses, but also how the predicates can be invoked. The two main strategies for top-down induction of logic programs, Cov...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003